Updating the complexity status of coloring graphs without a fixed induced linear forestBROERSMA, Hajo; GOLOVACH, Petr A; PAULUSMA, Daniël et al.Theoretical computer science. 2012, Vol 414, Num 1, pp 9-19, issn 0304-3975, 11 p.Article

Branching bisimulation congruence for probabilistic systemsANDOVA, Suzana; GEORGIEVSKA, Sonja; TRCKA, Nikola et al.Theoretical computer science. 2012, Vol 413, Num 1, pp 58-72, issn 0304-3975, 15 p.Article

Quantitatively fair schedulingBIANCO, Alessandro; FAELLA, Marco; MOGAVERO, Fabio et al.Theoretical computer science. 2012, Vol 413, Num 1, pp 160-175, issn 0304-3975, 16 p.Article

A short proof that adding some permutation rules to β preserves SNDAVID, René.Theoretical computer science. 2011, Vol 412, Num 11, pp 1022-1026, issn 0304-3975, 5 p.Article

A timed calculus for wireless systemsMERRO, Massimo; BALLARDIN, Francesco; SIBILIO, Eleonora et al.Theoretical computer science. 2011, Vol 412, Num 47, pp 6585-6611, issn 0304-3975, 27 p.Article

A volume first maxima-finding algorithmXIANGQUAN QUI; XIAOHONG HAO; YUANPING ZHANG et al.Theoretical computer science. 2011, Vol 412, Num 45, pp 6316-6326, issn 0304-3975, 11 p.Article

An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edgesJIANXI FAN; XIAOHUA JIA; BAOLEI CHENG et al.Theoretical computer science. 2011, Vol 412, Num 29, pp 3440-3450, issn 0304-3975, 11 p.Article

Approximating directed weighted-degree constrained networksNUTOV, Zeev.Theoretical computer science. 2011, Vol 412, Num 8-10, pp 901-912, issn 0304-3975, 12 p.Article

Approximation algorithms for grooming in optical network designANTONAKOPOULOS, Spyridon; ZHANG, Lisa.Theoretical computer science. 2011, Vol 412, Num 29, pp 3738-3751, issn 0304-3975, 14 p.Article

Asynchronous deterministic rendezvous in bounded terrainsCZYZOWICZ, Jurek; ILCINKAS, David; LABOUREL, Arnaud et al.Theoretical computer science. 2011, Vol 412, Num 50, pp 6926-6937, issn 0304-3975, 12 p.Article

BANDWIDTH on AT-free graphsGOLOVACH, Petr; HEGGERNES, Pinar; KRATSCH, Dieter et al.Theoretical computer science. 2011, Vol 412, Num 50, pp 7001-7008, issn 0304-3975, 8 p.Article

Cache-oblivious index for approximate string matchingHON, Wing-Kai; LAM, Tak-Wah; SHAH, Rahul et al.Theoretical computer science. 2011, Vol 412, Num 29, pp 3579-3588, issn 0304-3975, 10 p.Article

Certificateless cryptography with KGC trust level 3GUOMIN YANG; CHIK HOW TAN.Theoretical computer science. 2011, Vol 412, Num 39, pp 5446-5457, issn 0304-3975, 12 p.Article

Certificateless public key encryption: A new generic construction and two pairing-free schemesGUOMIN YANG; CHIK HOW TAN.Theoretical computer science. 2011, Vol 412, Num 8-10, pp 662-674, issn 0304-3975, 13 p.Article

Complexity dichotomy on partial grid recognitionDE SA, Vinícius G. P; DA FONSECA, Guilherme D; MACHADO, Raphael C. S et al.Theoretical computer science. 2011, Vol 412, Num 22, pp 2370-2379, issn 0304-3975, 10 p.Article

Complexity of clique coloring and related problemsMARX, Dániel.Theoretical computer science. 2011, Vol 412, Num 29, pp 3487-3500, issn 0304-3975, 14 p.Article

Compositional synthesis of asynchronous automataBAUDRU, Nicolas.Theoretical computer science. 2011, Vol 412, Num 29, pp 3701-3716, issn 0304-3975, 16 p.Article

Constructive semantics for instantaneous reactionsAGUADO, Joaquín; MENDLER, Michael.Theoretical computer science. 2011, Vol 412, Num 11, pp 931-961, issn 0304-3975, 31 p.Article

Correctness of linear logic proof structures is NL-completeJACOBE DE NAUROIS, Paulin; MOGBIL, Virgile.Theoretical computer science. 2011, Vol 412, Num 20, pp 1941-1957, issn 0304-3975, 17 p.Article

Decidability and complexity of Petri nets with unordered dataROSA-VELARDO, Fernando; DE FRUTOS-ESCRIG, David.Theoretical computer science. 2011, Vol 412, Num 34, pp 4439-4451, issn 0304-3975, 13 p.Article

Evolving schemas for streaming XMLSHOARAN, M; THOMO, A.Theoretical computer science. 2011, Vol 412, Num 35, pp 4545-4557, issn 0304-3975, 13 p.Article

Exact algorithms to minimize interference in wireless sensor networksHAISHENG TAN; TIANCHENG LOU; YUEXUAN WANT et al.Theoretical computer science. 2011, Vol 412, Num 50, pp 6913-6925, issn 0304-3975, 13 p.Article

Extending the notion of rationality of selfish agents: Second Order Nash equilibriaBILO, Vittorio; FLAMMINI, Michele.Theoretical computer science. 2011, Vol 412, Num 22, pp 2296-2311, issn 0304-3975, 16 p.Article

Faster parameterized algorithms for minor containmentADLER, Isolde; DORN, Frederic; FOMIN, Fedor V et al.Theoretical computer science. 2011, Vol 412, Num 50, pp 7018-7028, issn 0304-3975, 11 p.Article

From regular expressions to smaller NFAsGARCIA, Pedro; LOPEZ, Damián; RUIZ, José et al.Theoretical computer science. 2011, Vol 412, Num 41, pp 5802-5807, issn 0304-3975, 6 p.Article